An Improved Particle Swarm Optimization Technique for Solving the Unit Commitment Problem

نویسندگان

  • A. M. Moussa
  • M. E. Gammal
  • A. A. Ghazala
  • A. I. Attia
چکیده

Automation of power system nowadays is one of the great spreading fields in electrical engineering. Artificial Intelligence Technique helps in developing and modifying the automated power system. The particle swarm optimization (PSO) technique is one of the recent artificial intelligent techniques. In this thesis a modified particle swarm optimization (MPSO) is utilized in Unit Commitment Problem (UCP). This paper presents a MPSO algorithm to solve a power generator scheduling problem known as the Unit Commitment Problem (UCP). The main objective of the unit commitment is to minimize the total production cost over the study period and to satisfy the constraints imposed on the system. The proposed technique is tested on 26 generator-scheduling problems with 24h scheduling horizon. The simulation results have been observed and analyzed. The developed technique can generate a high quality solution within short calculation time. Comparison of results with those of other methods justifies the flexibility, effectiveness and applicability of the proposed method with regards to minimizing both the total operation cost and execution time. KeywordsUnit Commitment (U.C), Modified Particle Swarm Optimization (MPSO), Economic Dispatch (E.D)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Security Constrained Unit Commitment by Particle Swarm Optimization

The issue of unit commitment is one of the most important economic plans in power system. In modern and traditional power systems, in addition to being economical of the planning, the issue of security in unit operation is also of great importance. Hence power system operation confronts units’ participation and input considering network security constrains. The issue of units’ participation is ...

متن کامل

An improved particle swarm optimization with a new swap operator for team formation problem

Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...

متن کامل

A Solution to Unit Commitment Problem via Dynamic Programming and Particle Swarm Optimization

The optimization problem while committing the units is minimizing the entire production cost, at the same time meeting the demand and fulfilling the equality and inequality limits. In order to supply adequate power to the consumers in a cost-effective and secured way the commitment of thermal units is the best option available. The commitment of generating units is done depending upon the predi...

متن کامل

Economic Dispatch of Thermal Units with Valve-point Effect using Vector Coevolving Particle Swarm Optimization Algorithm

Abstract: This paper is intended to reduce the cost of producing fuel from thermal power plants using the problem of economic distribution. This means that in order to determine the share of each unit, considering the amount of consumption and restrictions, including the ones that can be applied to the rate of increase, the prohibited operating areas and the barrier of the vapor barrier, the pr...

متن کامل

An Improved Particle Swarm Optimization Approach for Unit Commit- ment Problem

Unit commitment problem is a large scale nonlinear hybrid integer programming problem. Optimal unit commitment scheduling involves determining on/off states of units and determining generations of units. This paper proposes an improved particle swarm optimization (IPSO) for the solution of optimal unit commitment problem (UCP). In the proposed approach, the on/off states of units are limited in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011